[ 7 ] Wolfgang Faber , Nicola Leone

Using the dlv System for Planning and Diagnostic Reasoning

New DLV Features for Data Integration

The DLV system is currently employed in projects on data integration – a challenging application area for Answer Set Programming. The present system description illustrates some new optimization techniques, which significantly enhance the general performance of DLV, and especially in the context of data integration.

The Intelligent Grounder of DLV

In this work, we give an overview of the DLV Intelligent Grounder, one of the most popular Answer Set Programming instantiators, and a very strong point of the DLV system. Based on a variant of semi-naive evaluation, it also includes several advanced optimization techniques and supports a number of application-oriented features which allow for the successful exploitation of DLV in real-world co...

Well-Founded Semantics for Logic Programs with Aggregates: Implementation and Experimentation

Aggregate constructs are one of the major linguistic extensions to logic programming. In this paper, we focus on logic programming with monotone and antimonotone aggregate literals with the well-founded semantics defined in [1], which allows for aggregates occurring in recursive definitions. We formally show that computing this semantics is tractable and present a prototype system obtained by m...

Heuristics for Hard ASP Programs

We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2 /Π P 2 hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also th...